Properties of Magic Squares of Squares
نویسنده
چکیده
A problem due to Martin LaBar is to find a 3x3 magic square with 9 distinct perfect square entries or prove that such a magic square cannot exist (LaBar [1]). This problem has been tied to various domains including arithmetic progressions, rational right triangles, and elliptic curves (Robertson [2]). However, there are some interesting properties that can be derived without ever leaving the domain of magic squares. I will assume that a solution exists and prove properties of such a solution. Any solution must have the form
منابع مشابه
Franklin Squares: A Chapter in the Scientific Studies of Magical Squares
Several aspects of magic(al) squares studies fall within the computational universe. Experimental computation has revealed patterns, some of which have lead to analytic insights, theorems, or combinatorial results. Other numerical experiments have provided statistical results for some very difficult problems. While classical nth order magic squares with the entries 1..n2 must have the magic sum...
متن کاملFranklin Squares - a Chapter in the Scientic Studies of Magical Squares
Several aspects of magic(al) square studies fall within the computational universe. Experimental computation has revealed patterns, some of which have lead to analytic insights, theorems or combinatorial results. Other numerical experiments have provided statistical results for some very di¢ cult problems. Schindel, Rempel and Loly have recently enumerated the 8th order Franklin squares. While ...
متن کاملCreating Semi-Magic, Magic and Extra Magic n× n Squares when n is Odd
We define a simple algorithm for creating large numbers of semi-magic n× n squares when n is odd. Special cases of the algorithm can also be used to easily create magic and extra magic (or panmagic) n× n squares when n is odd. The algorithm can also create extremely magic n × n squares when n ≥ 5 is prime. These extremely magic n × n squares have n! standard magic n-element subsets, and these n...
متن کاملPolyhedral Cones of Magic Cubes and Squares
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes. Magic cubes and squares are very popular combinatorial objects (see [2, 15, 17] and their references). A magic square is a square matrix whose entries are nonnegative integers and whose row sums, column sums...
متن کاملBordered magic squares: Elements for a comprehensive approach
General methods for the construction of magic squares of any order have been searched for centuries. Several " standard strategies " have been found for this purpose, such as the " knight movement " , or the construction of bordered magic squares, which played an important role in the development of general methods. What we try to do here is to give a general and comprehensive approach to the c...
متن کامل